On bounding boxes of iterated function system attractors
نویسندگان
چکیده
Before rendering 2D or 3D fractals with iterated function systems, it is necessary to calculate the bounding extent of fractals. We develop a new algorithm to compute the bounding box which closely contains the entire attractor of an iterated function system. r 2003 Elsevier Science Ltd. All rights reserved.
منابع مشابه
Explicit Bounding Circles for IFS Fractals
The attractors of Iterated Function Systems in Euclidean space IFS fractals have been the subject of great interest for their ability to visually model a wide range of natural phenomena. Indeed computer-generated plants are often modeled using 3D IFS fractals, and thus their extent in virtual space is a fundamental question, whether for collision detection or ray tracing. A great variety of alg...
متن کاملApollonian Circumcircles of IFS Fractals
The attractors of Iterated Function Systems in Euclidean space IFS fractals have been the subject of great interest for their ability to visually model a wide range of natural phenomena. Indeed computer-generated plants are often modeled using 3D IFS fractals, and thus their extent in virtual space is a fundamental question, whether for collision detection or ray tracing. A great variety of alg...
متن کاملChaotic property for non-autonomous iterated function system
In this paper, the new concept of non-autonomous iterated function system is introduced and also shown that non-autonomous iterated function system IFS(f_(1,∞)^0,f_(1,∞)^1) is topologically transitive for the metric space of X whenever the system has average shadowing property and its minimal points on X are dense. Moreover, such a system is topologically transitive, whenever, there is a point ...
متن کاملBounding Iterated Function Systems via Convex Optimization
We present an algorithm to construct a bounding polyhedron for an affine Iterated Function System (IFS). Our algorithm expresses the IFS-bounding problem as a set of linear constraints on a linear objective function, which can then be solved via standard techniques for linear convex optimization. As such, our algorithm is guaranteed to find the optimum recursively instantiable bounding volume, ...
متن کاملConnectedness of the Attractors of Iterated Function Systems
We survey some of the topological properties of the attractors of iterated function systems such as connectedness, arcwise connectedness and locally arcwise connectedness. We give necessary and sufficient conditions for the attractors of finite iterated function system (IFS) to be a connected sets and in the case when infinite iterated function systems (IIFS) are considered we give only some su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & Graphics
دوره 27 شماره
صفحات -
تاریخ انتشار 2003